package com.leetcode.easy;

import java.util.HashMap;
import java.util.Map;

import org.junit.Test;

public class TwoSum {

	@Test
	public void test( ) {
		int[] result =twoSum(new int[]{1,6,7,9,5}, 12);
		for (int a:result) {
			System.out.println(a);
		}
	}
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            int complement = target - nums[i];
            if (map.containsKey(complement)) {
                return new int[] { map.get(complement), i };
            }
            map.put(nums[i], i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}
